KNN Query Processing 0f Secured Multi Data Owner Using Voronoi Diagram
نویسندگان
چکیده
an economical and flexible way to data owners for delivering spatial data to users of location-based services would be Outsourcing spatial databases to the cloud. In this data outsourcing model the service provider can be untrustworthy. It may return incorrect or incomplete query results to clients intentionally or not. Ensuring spatial query integrity is critical. Here an efficient road network is proposed, with k-nearest-neighbor query verification technique which utilizes the network Voronoi diagram and neighbors to prove the integrity of query results. To deal with data integrity and authentication problem for outsourced databases Digital Signature is used. This Technique verifies both the distances and the shortest paths from the query point to its kNN results on the road network. Data owner builds an authenticated data structure before providing the data to the service provider. Knearest-neighbor query verification technique utilizes the network Voronoi diagram and neighbors to prove the integrity of query results in ROAD Network.Skyline queries take into account both the spatial and non-spatial attributes of the points. For example instead of considering all the hotels, a nearest neighbor query would instead ask for the hotel that is closest to among those who provide services such as pool, internet at the same time. Keywords— data outsourcing, location based services, service provider, road network, voronoi diagram, skyline queries.
منابع مشابه
An Efficient Method for k Nearest Neighbor Searching in Obstructed Spatial Databases
Currently, there has been an increasing development in the area of location-based service. An important type of query in this area is k nearest neighbor (kNN) query, which retrieves the top k nearest neighbors based on the user's position. Although a wide spectrum of work has been conducted on this query type, most of these studies focus on the ideal Euclidean plane without obstacles considered...
متن کاملIndexing Network Voronoi Diagrams
The Network Voronoi diagram and its variants have been extensively used in the context of numerous applications in road networks, particularly to efficiently evaluate various spatial proximity queries such as k nearest neighbor (kNN), reverse kNN, and closest pair. Although the existing approaches successfully utilize the network Voronoi diagram as a way to partition the space for their specifi...
متن کاملVoronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between objects depend on their network connectivity and it is computationally expensive to compute the distances (e.g., shortest paths) between objects. In this paper, we propose a novel approach to efficiently and accurately ev...
متن کاملkNN-R: Building Secure and Efficient Outsourced kNN Query Service with the RASP Encryption
Xu, Huiqi. M.S., Department of Computer Science and Engineering, Wright State University, 2012. kNN-R: Building Secure and Efficient Outsourced kNN Query Service with the RASP encryption. With the wide deployment of public cloud computing infrastructures, outsourcing database services to the cloud has become an appealing solution to save operating expense. However, some databases might be so se...
متن کاملSkyline Diagram: Finding the Voronoi Counterpart for Skyline Queries
Skyline queries are important in many application domains. In this paper, we propose a novel structure Skyline Diagram, which given a set of points, partitions the plane into a set of regions, referred to as skyline polyominos. All query points in the same skyline polyomino have the same skyline query results. Similar to kth-order Voronoi diagram commonly used to facilitate k nearest neighbor (...
متن کامل